package practice;

import java.util.Arrays;
import java.util.List;
import java.util.Scanner;

public class _丰收_ {
    public static void main(String[] args) {
        _丰收_ c = new _丰收_();
        _丰收_.Solution s = c.getSolution();
        s.Main();
    }

    Solution getSolution() {
        return new Solution();
    }

    class Solution {
        public void Main() {
            Scanner sc = new Scanner(System.in);
            int n = sc.nextInt();
            int[] arr_n_num = new int[n];
            for (int i = 0; i < n; i++) {
                arr_n_num[i] = sc.nextInt();
            }
            int m = sc.nextInt();
            Integer[] arr_m_num = new Integer[m];
            for (int i = 0; i < m; i++) {
                arr_m_num[i] = sc.nextInt();
            }
            Integer[] beforeSum = new Integer[n];
            for (int i = 0; i < n; i++) {
                if (i == 0) beforeSum[i] = arr_n_num[i];
                else beforeSum[i] = beforeSum[i - 1] + arr_n_num[i];
            }
            int[] res = new int[m];
            Integer[] m_arr2 = arr_m_num.clone();
            Arrays.sort(m_arr2);
//            ArrayList<Integer> m_list = new ArrayList<Integer>(Arrays.asList(arr_m_num));
            List<Integer> m_list = Arrays.asList(arr_m_num);
            int start = 1;
            for (int i = 0; i < m; i++) {
                int loc = where(start-1, m_arr2[i], beforeSum);
                res[m_list.indexOf(m_arr2[i])] = loc;
                start = loc;
            }
            for (int i = 0; i < m; i++) {
                System.out.println(res[i]);
            }
        }

        private int where(int start, int pos, Integer[] arr) {
            int place = 0;
            for (int i = start; i < arr.length; i++) {
                if (pos - arr[i] <= 0) return i + 1;
                else continue;
            }
            return arr.length;
        }
    }
}
